ProoFVer: Natural Logic Theorem Proving for Fact Verification

نویسندگان

چکیده

Abstract Fact verification systems typically rely on neural network classifiers for veracity prediction, which lack explainability. This paper proposes ProoFVer, uses a seq2seq model to generate natural logic-based inferences as proofs. These proofs consist of lexical mutations between spans in the claim and evidence retrieved, each marked with logic operator. Claim is determined solely based sequence these operators. Hence, are faithful explanations, this makes ProoFVer by construction. Currently, has highest label accuracy second best score FEVER leaderboard. Furthermore, it improves 13.21% points over next dataset counterfactual instances, demonstrating its robustness. As show better overlap human rationales than attention-based highlights help humans predict decisions correctly more often using directly.1

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Theorem Proving for Verification

The challenges in using theorem proving for verification of parallel systems are to achieve adequate automation, and to allow human guidance to be expressed in terms of the system under examination rather than the mechanisms of the prover. This paper provides an overview of techniques that address these challenges.

متن کامل

Theorem Proving Languages for Verification

Verification is a hard task, but much progress has been achieved recently. Many verification problems have been shown decidable by reducing them to modelchecking finite state transition systems. Verification of infinite state transition systems has achieved tremendous progress too, by showing that many particular cases were themselves decidable, such as timed automata [1] or some forms of pushd...

متن کامل

Model Verification via Theorem Proving

Data Model Verification via Theorem Proving

متن کامل

Cogent: Accurate Theorem Proving for Program Verification

Many symbolic software verification engines such as Slam and ESC/Java rely on automatic theorem provers. The existing theorem provers, such as Simplify, lack precise support for important programming language constructs such as pointers, structures and unions. This paper describes a theorem prover, Cogent, that accurately supports all ANSI-C expressions. The prover’s implementation is based on ...

متن کامل

Accurate Theorem Proving for Program Verification

Symbolic software verification engines such as Slam and ESC/Java often use automatic theorem provers to implement forms of symbolic simulation. The theorem provers that are used, such as Simplify, usually combine decision procedures for the theories of uninterpreted functions, linear arithmetic, and sometimes bit vectors using techniques proposed by Nelson-Oppen or Shostak. Programming language...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the Association for Computational Linguistics

سال: 2022

ISSN: ['2307-387X']

DOI: https://doi.org/10.1162/tacl_a_00503